Generic subset ranking using binary classifiers
نویسندگان
چکیده
منابع مشابه
Single Feature Ranking and Binary Particle Swarm Optimisation Based Feature Subset Ranking for Feature Selection
This paper proposes two wrapper based feature selection approaches, which are single feature ranking and binary particle swarm optimisation (BPSO) based feature subset ranking. In the first approach, individual features are ranked according to the classification accuracy so that feature selection can be accomplished by using only a few top-ranked features for classification. In the second appro...
متن کاملText Dependent Speaker Verification Using Binary Classifiers Text Dependent Speaker Verification Using Binary Classifiers
This paper describes how a speaker veri cation task can be advantageously decom posed into a series of binary classi cation problems i e each problem discriminating between two classes only Each binary classi er is speci c to one speaker one anti speaker and one word De cision trees dealing with attributes of continuous values are used as classi ers The set of classi ers is then pruned to elimi...
متن کاملOptimal threshold estimation for binary classifiers using
Many bioinformatics algorithms can be understood as binary classifiers. They are usually compared using the area under the receiver operating characteristic ( ) curve. On the other hand, choosing the best threshold for practical use ROC is a complex task, due to uncertain and context-dependent skews in the abundance of positives in nature and in the yields/costs for correct/incorrect classifica...
متن کاملText dependent speaker verification using binary classifiers
This paper describes how a speaker verification task can be advantageously decomposed into a series of binary classification problems, i.e. each problem discriminating between two classes only. Each binary classifier is specific to one speaker, one anti-speaker and one word. Decision trees dealing with attributes of continuous values are used as classifiers. The set of classifiers is then prune...
متن کاملNaive Bayesian Classifiers for Ranking
It is well-known that naive Bayes performs surprisingly well in classification, but its probability estimation is poor. In many applications, however, a ranking based on class probabilities is desired. For example, a ranking of customers in terms of the likelihood that they buy one’s products is useful in direct marketing. What is the general performance of naive Bayes in ranking? In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.05.026